Multistage Stochastic Decomposition: A Bridge between Stochastic Programming and Approximate Dynamic Programming
نویسندگان
چکیده
منابع مشابه
Multistage Stochastic Unit Commitment Using Stochastic Dual Dynamic Integer Programming
Unit commitment (UC) is a key operational problem in power systems used to determine an optimal daily or weekly generation commitment schedule. Incorporating uncertainty in this already difficult mixed-integer optimization problem introduces significant computational challenges. Most existing stochastic UC models consider either a two-stage decision structure, where the commitment schedule for ...
متن کاملA Primal-Dual Decomposition Algorithm for Multistage Stochastic Convex Programming
This paper presents a new and high performance solution method for multistage stochastic convex programming. Stochastic programming is a quantitative tool developed in the field of optimization to cope with the problem of decision-making under uncertainty. Among others, stochastic programming has found many applications in finance, such as asset-liability and bond-portfolio management. However,...
متن کاملRamsey Stochastic Model via Multistage Stochastic Programming
Ramsey model belongs to “classical” economic dynamic models. It has been (1928) originally constructed (with a farmer’s interpretation) in a deterministic discrete setting. To solve it Lagrangean or dynamic programming techniques can be employed. Later, this model has been generalized to a stochastic version. Time horizon in the original deterministic model as well as in modified stochastic one...
متن کاملApproximate Dynamic Programming by Linear Programming for Stochastic Scheduling
In stochastic scheduling, we want to allocate a limited amount of resources to a set of jobs that need to be serviced. Unlike in deterministic scheduling, however, the parameters of the system may be stochastic. For example, the time it takes to process a job may be subject to random fluctuations. Stochastic scheduling problems occur in a variety of practical situations, such as manufacturing, ...
متن کاملScenario decomposition of risk-averse multistage stochastic programming problems
We briefly discuss some history on the development of risk-averse optimization leading into coherent risk measures. For a riskaverse multistage stochastic optimization problem with a finite scenario tree, we introduce a new scenario decomposition method and prove its convergence. We then show how to apply our method to a typical operations management inventory and assembly problem. BIOGRAPHY Dr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 2014
ISSN: 1052-6234,1095-7189
DOI: 10.1137/120864854